On the Synthesis of Strategies in Infinite Games

Completeness and Weak Completeness Under Polynomial-Size Circuits p. 26 Communication Complexity of Key Agreement on Small Ranges p. 38 Pseudorandom Generators and the Frequency of Simplicity p. 50 Classes of Bounded Counting Type and their Inclusion Relations p. 60 Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates p. 71 On Realizing Iterated Multiplication by Small Depth Threshold Circuits p. 83 A Random NP-Complete Problem for Inversion of 2D Cellular Automata p. 95 On the Subword Equivalence Problem for Infinite Words p. 107 On the Separators on an Infinite Word Generated by a Morphism p. 119 Systolic Tree [omega]-Languages p. 131 Structural Complexity of [omega]-Automata p. 143 Algorithms Explained by Symmetries p. 157 Generalized Scans and Tri-Diagonal Systems p. 168 Two-Dimensional Pattern Matching in Linear Time and Small Space p. 181 On-line and Dynamic Algorithms for Shortest Path Problems p. 193 On Compact Representations of Propositional Circumscription p. 205 A Set-Theoretic Translation Method for (Poly)modal Logics p. 217 On the Synthesis of Discrete Controllers for Timed Systems p. 229 A Fully Abstract Semantics for Causality in the [pi]-Calculus p. 243 On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks p. 255